Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
نویسندگان
چکیده
منابع مشابه
Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization
We present a unified framework to analyze the global convergence of Langevin dynamics based algorithms for nonconvex finite-sum optimization with n component functions. At the core of our analysis is a direct analysis of the ergodicity of the numerical approximations to Langevin dynamics, which leads to faster convergence rates. Specifically, we show that gradient Langevin dynamics (GLD) and st...
متن کاملConvergence of a Recurrent Neural Network for Nonconvex Optimization Based on an Augmented Lagrangian Function
In the paper, a recurrent neural network based on an augmented Lagrangian function is proposed for seeking local minima of nonconvex optimization problems with inequality constraints. First, each equilibrium point of the neural network corresponds to a Karush-KuhnTucker (KKT) point of the problem. Second, by appropriately choosing a control parameter, the neural network is asymptotically stable...
متن کاملGlobal Convergence of Splitting Methods for Nonconvex Composite Optimization
We consider the problem of minimizing the sum of a smooth function h with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function P and a surjective linear map M, with the proximal mappings of τP , τ > 0, simple to compute. This problem is nonconvex in general and encompasses many important applications in engineering and mach...
متن کاملGlobal Convergence of ADMM in Nonconvex Nonsmooth Optimization
In this paper, we analyze the convergence of the alternating direction method of multipliers (ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, φ(x0, . . . , xp, y), subject to coupled linear equality constraints. Our ADMM updates each of the primal variables x0, . . . , xp, y, followed by updating the dual variable. We separate the variable y from xi’s as it has a spe...
متن کاملA Deterministic Lagrangian- Based Global Optimization Approach for Quasiseparable Nonconvex Mixed-Integer Nonlinear Programs
We propose a deterministic approach for global optimization of nonconvex quasiseparable problems encountered frequently in engineering systems design. Our branch and bound-based optimization algorithm applies Lagrangian decomposition to (1) generate tight lower bounds by exploiting the structure of the problem and (2) enable parallel computing of subsystems and use of efficient dual methods. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2018
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2017.0900